A Comparison of Global and Partitioned EDF Schedulability Tests for Multiprocessors TR-051101
نویسنده
چکیده
This paper compares the performance of several variations on EDF-based global and partitioned multiprocessor scheduling algorithms, together with their associated feasibility tests, on a variety of pseudo-randomly chosen sets of sporadic tasks. A new hybrid EDF-based scheme is shown to perform better than previously studied priority-based global scheduling schemes, though not as well as EDF-based first-fit partitioned scheduling.
منابع مشابه
Comparison of Empirical Success Rates of Global vs. Partitioned Fixed-Priority and EDF Scheduling for Hard Real Time TR-050601
Improvements in schedulability tests for global fixed-priority and EDF scheduling in a homogeneous multiprocessor (symmetric multiprocessing) environment have shown that the worst-case guaranteed achievable utilization levels for global EDF scheduling equals what can be achieved with partitioned scheduling, and both ways of applying EDF scheduling out-perform fixed-priority scheduling, for sets...
متن کاملFurther improved schedulability analysis of EDF on multiprocessor platforms TR-051001
This report shows how to tighten the analysis of global EDF scheduling on multiprocessor platforms, so as to verify the feasibility of a significantly larger range of task systems than has been possible using the previously known tests, including those recently by Bertogna, Cirinei, and Lipari. The improved EDF feasibility test for sporadic task systems with arbitrary deadlines is proven correc...
متن کاملA unified analysis of global EDF and fixed-task-priority schedulability of sporadic task systems on multiprocessors
Fixed-task-priority (FTP) scheduling and earliest-deadline-first (EDF) scheduling policies are alike in fixing the priority of each job of a task at the time the job is released. This common feature of FTP and EDF scheduling permits a unified analysis of scheduling failures, to derive new sufficient tests for meeting all deadlines of a set of independent sporadic tasks under a global preemptive...
متن کاملTests for global EDF schedulability analysis
Several schedulability tests have been proposed for global EDF scheduling on identical multiprocessors. All these tests are sufficient, rather than exact. These different tests were, for the most part, independently developed. The relationships among such tests have not been adequately investigated, so that it is difficult to understand which test is most appropriate in a particular given scena...
متن کاملMultiprocessor Schedulability Analysis for Self - Suspending Task Systems ∗
In many real-time systems, tasks may experience suspension delays. The problem of analyzing task systems with such suspensions on multiprocessors has been relatively unexplored and is thought to be difficult (as it is on uniprocessors). In this paper, hard/soft multiprocessor schedulability tests for arbitrary-deadline sporadic self-suspending task systems are presented for both global EDF and ...
متن کامل